Maximizing Throughput of Finite Population Slotted Aloha
نویسنده
چکیده
We consider finite population slotted ALOHA where each of n terminals ma.y ha.ve its own transmission proba.bility Pi. Given the traffic load .A, throughput is maximized via. a constrained optimization problem. The resulu; of Abramson (1985) are obtained as special case. .
منابع مشابه
Proposed ST-Slotted-CS-ALOHA Protocol for Time Saving and Collision Avoidance
Time Saving and energy consumption has become a vital issue that attracts the attention of researchers in Underwater Wireless Sensor Networks (UWSNs) fields. According to that, there is a strong need to improve MAC protocols performance in UWSNs, particularly enhancing the effectiveness of ALOHA Protocol. In this paper, a time-saving Aloha protocol with slotted carrier sense proposed which we c...
متن کاملOn Channel Access Probabilities Which Maximize Throughput of Slotted Aloha
We consider finite population slotted ALOHA where each of n terminals has its own transmission probability Pi. Given the overall traffic load A, the probabilities Pi are determined in such a way as to maximize throughput. This is achieved by solving a constrained optimization problem. The results of Abramson (1970) are obtained as a special case. Our recent results are improved (Mathar and Zili...
متن کاملFIFO by Sets ALOHA (FS-ALOHA): A Collision Resolution Algorithm for the Contention Channel in Wireless ATM Systems
This paper presents a Collision Resolution Algorithm which significantly improves the performance in terms of throughput and delay of the uplink contention channel existing in Wireless ATM MAC protocols such as MASCARA [9], where slotted ALOHA is employed. FS-ALOHA groups the requests arrived at the mobile terminals during a frame length and serves these groups on a FIFO basis using slotted ALO...
متن کاملDelay distributions of slotted ALOHA and CSMA
In this paper, we derive the closed-form delay distributions of slotted ALOHA and nonpersistent carrier sense multiple access (CSMA) protocols under steady state. Three retransmission policies are analyzed. We find that under a binary exponential backoff retransmission policy, finite average delay and finite delay variance can be guaranteed for 2 and 4 3, respectively, where is the channel traf...
متن کاملGeneralized Encoding CRDSA: Maximizing Throughput in Enhanced Random Access Schemes for Satellite
This work starts from the analysis of the literature about the Random Access protocols with contention resolution, such as Contention Resolution Diversity Slotted Aloha (CRDSA), and introduces a possible enhancement, named Generalized Encoding Contention Resolution Diversity Slotted Aloha (GE-CRDSA). The GE-CRDSA aims at improving the aggregated throughput when the system load is less than 50%,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014